#include <unordered_map>
class Solution {
public:
    
    bool IsContinuous(vector<int>& numbers) {
        sort(numbers.begin(),numbers.end());
        int zero=0;
        int gap=0;
        for(int i=0;i<numbers.size();i++)
        {
            if(numbers[i]==0) ++zero;
        }
        for(int i=zero;i<numbers.size()-1;i++){
            if(numbers[i]==numbers[i+1]) return false;

            gap+=(numbers[i+1]-numbers[i]-1);
        }
        return gap<=zero;

    }
};